Corrigendum: Stable Matchings and Preferences of Couples∗
نویسندگان
چکیده
We correct an omission in the definition of the domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.
منابع مشابه
Corrigendum to "Stable matchings and preferences of couples" [J. Econ. Theory 121 (1) (2005) 75-106]
We correct an omission in the definition of the domain of weakly responsive preferences introduced in [B. Klaus, F. Klijn, Stable matchings and preferences of couples, J. Econ. Theory 121 (2005) 75–106] or KK05 for short. The proof of the existence of stable matchings [KK05, Theorem 3.3] and a maximal domain result [KK05, Theorem 3.5] are adjusted accordingly. © 2009 Elsevier Inc. All rights re...
متن کاملThe Stable Matching Linear Program and an Approximate Rural Hospital Theorem with Couples
The deferred acceptance algorithm has been the most commonly studied tool for computing stable matchings. An alternate less-studied approach is to use integer programming formulations and linear programming relaxations to compute optimal stable matchings. Papers in this area tend to focus on the simple ordinal preferences of the stable marriage problem. This paper advocates the use of linear pr...
متن کاملPaths to stability for matching markets with couples
We study two-sided matching markets with couples and show that for a natural preference domain for couples, the domain of weakly responsive preferences, stable outcomes can always be reached by means of decentralized decision making. Starting from an arbitrary matching, we construct a path of matchings obtained from ‘satisfying’ blocking coalitions that yields a stable matching. Hence, we estab...
متن کاملStable matchings and preferences of couples
Couples looking for jobs in the same labor market may cause instabilities. We determine a natural preference domain, the domain of weakly responsive preferences, that guarantees stability. Under a restricted unemployment aversion condition we show that this domain is maximal for the existence of stable matchings. We illustrate how small deviations from (weak) responsiveness, that model the wish...
متن کاملMajority Voting in Stable Marriage Problem with Couples
Providing centralised matching services can be viewed as a group decision support system (GDSS) for the participants to reach a stable matching solution. In the original stable marriage problem all the participants have to rank all members of the opposite party. Two variations for this problem allow for incomplete preference lists and ties in preferences. If members from one side are allowed to...
متن کامل